Multi-leader election in dynamic sensor networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Secure Leader Election in Wireless Sensor Networks

Wireless sensor networks are networks of resourceconstrained embedded sensor devices. Oftentimes in these situations, it is beneficial to designate groups of sensors with leader nodes that relay information about the other nodes in the group, rather than maintaining communication with every single node in the group. Leaders can be chosen via leader election protocols, but it is especially impor...

متن کامل

Fast Byzantine Leader Election in Dynamic Networks

We study the fundamental Byzantine leader election problem in dynamic networks where the topology can change from round to round and nodes can also experience heavy churn (i.e., nodes can join and leave the network continuously over time). We assume the full information model where the Byzantine nodes have complete knowledge about the entire state of the network at every round (including random...

متن کامل

Algebraic Speciication of Dynamic Leader Election Protocols in Broadcast Networks

The problem of leader election in distributed systems is considered. Components communicate by means of buuered broadcasting as opposed to usual point-to-point communication. In this paper three leader election protocols of increasing maturity are speciied. We start with a simple leader election protocol, where an initial leader is present. In the second protocol this assumption is dropped. Eve...

متن کامل

Leader election in synchronous networks

Worst, best and average number of messages and running time of leader election algorithms of different distributed systems are analyzed. Among others the known characterizations of the expected number of messages for LCR algorithm and of the worst number of messages of Hirschberg-Sinclair algorithm are improved.

متن کامل

An Improved Leader Election Protocol in Multi-hop Radio Networks

This paper presents two randomized protocols for the problem of electing a \leader" among a set of nodes in an arbitrary multi-hop radio network. First, a variation of the leader election protocol by Bar-Yehuda et al. BGI87] is presented, in which the termination problem is addressed. Then, an eecient randomized leader election protocol in arbitrary multi-hop radio networks is presented. Our el...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EURASIP Journal on Wireless Communications and Networking

سال: 2017

ISSN: 1687-1499

DOI: 10.1186/s13638-017-0961-9